Grammar Compression by Induced Suffix Sorting

A grammar compression algorithm, called GCIS, is introduced in this work. GCIS based on the induced suffix sorting algorithm SAIS, presented by Nong et al. 2009. The proposed solution builds factorization performed SAIS during sorting. context-free used to replace factors non-terminals. then recursively applied shorter sequence of resulting encoded exploiting some redundancies, such as common prefixes between right-hands rules, sorted according SAIS. excels for its low space and time required while obtaining competitive ratios. Our experiments regular repetitive, moderate very large texts, show that stands a convenient choice compared well-known compressors Gzip 7-Zip; RePair gold standard compression; recent SOLCA, LZRR, LZD. In exchange, slow at decompressing. Yet, are more than Lempel-Ziv one can access text substrings directly compressed form without ever decompressing text. We demonstrate an excellent candidate scenario, because it shows be among alternatives. also relation with makes good intermediate structure build array LCP decompression